Waiting time characteristics in cyclic queues
نویسندگان
چکیده
In this paper we study a single-server queue with FIFO service and cyclic interarrival and service times. An efficient approximative algorithm is developed for the first two moments of the waiting time. Numerical results are included to demonstrate that the algorithm yields accurate results. For the special case of exponential interarrival times we present a simple exact analysis.
منابع مشابه
A Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time
This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...
متن کاملWaiting times in queueing networks with a single shared server
We study a queueing network with a single shared server that serves the queues in a cyclic order. External customers arrive at the queues according to independent Poisson processes. After completing service, a customer either leaves the system or is routed to another queue. This model is very generic and finds many applications in computer systems, communication networks, manufacturing systems,...
متن کاملA new method for deriving waiting-time approximations in polling systems with renewal arrivals
We study the waiting-time distributions in cyclic polling models with renewal arrivals, general service and switch-over times, and exhaustive service at each of the queues. The assumption of renewal arrivals prohibits an exact analysis and reduces the available analytic results to heavy-traffic asymptotics, limiting results for large switch-over times and large numbers of queues, and some numer...
متن کاملApproximate Method to Study M/G/1-Type Polling System with Adaptive Polling Mechanism
Abstract: We investigate a polling model of a radio-cell of the broadband wireless IEEE 802.11 network. A radio-cell is assumed to work in the ‘‘data collection’’ regime. It is modeled by a polling system with N queues and a single server polling the queues in a cyclic adaptive order. Under adaptive scheme, the server (base station) skips (does not visit) the queues (subscriber stations) which ...
متن کاملبهبود فرایند مدیریت بیمار در اورژانس با شبیه سازی (PROMETHEE) و روش پرامیتی
Introduction: This article proposes a method which could improve the performance of an Emergency Department (ED) in a large hospital in Tehran, where the long waiting times cause patients’ and ED staff ’s dissatisfaction. ED is considered as a bottleneck in hospitals. To reduce long waiting time and improve patient satisfaction, application of system improvement methods is required....
متن کامل